|
The XOR gate (sometimes EOR gate, or EXOR gate and pronounced as Exclusive OR gate) is a digital logic gate that implements an exclusive or; that is, a true output (1/HIGH) results if one, and only one, of the inputs to the gate is true. If both inputs are false (0/LOW) or both are true, a false output results. XOR represents the inequality function, i.e., the output is true if the inputs are not alike otherwise the output is false. A way to remember XOR is "one or the other but not both". XOR can also be viewed as addition modulo 2. As a result, XOR gates are used to implement binary addition in computers. A Half adder consists of an XOR gate and an AND gate. Other uses include subtractors, comparators, and controlled inverters. The algebraic expressions and ( ) both represent the XOR gate with inputs ''A'' and ''B''. The behavior of XOR is summarized in the truth table shown on the right. ==Symbols== There are two symbols for XOR gates: the traditional symbol and the IEEE symbol. For more information see Logic Gate Symbols. The logic symbols ⊕ and (unicode:⊻) can be used to denote XOR in algebraic expressions. C-like languages use the caret symbol ^ to denote bitwise XOR. (Note that the caret does not denote logical conjunction (AND) in these languages, despite the similarity of symbol.) 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「XOR gate」の詳細全文を読む スポンサード リンク
|